Linux Mutexes And Conditions

См. также в других словарях:

• Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the …   Wikipedia

• LMC — Large Magellanic Cloud (Governmental » NASA) Large Magellanic Cloud (Academic & Science » Astronomy) *** Library Media Center (Academic & Science » Universities) * Local Medical Committee (Medical) * Lockheed Martin Corporation (Business » Firms) …   Abbreviations dictionary

• DioneOS — (pronounced /djoneos/) is multitasking preemptive, real time operating system. The system is designed for Texas Instruments MSP430x microcontrollers. Target microcontroller platform has limited resources, i.e. system clock frequency in tens of… …   Wikipedia

• XFLAIM Database Engine — Infobox Software name = XFLAIM caption = latest release version = latest release date = operating system = Cross platform genre = Development Library license = GPL website = [http://developer.novell.com/wiki/index.php/FLAIM XFLAIM] TOC… …   Wikipedia

• Thread (computer science) — This article is about the concurrency concept. For the multithreading in hardware, see Multithreading (computer architecture). For the form of code consisting entirely of subroutine calls, see Threaded code. For other uses, see Thread… …   Wikipedia

• Race condition — in a logic circuit. Here, ∆t1 and ∆t2 represent the propagation delays of the logic elements. When the input value (A) changes, the circuit outputs a short spike of duration (∆t1+∆t2) ∆t2 = ∆t1. A race condition or race hazard is a flaw in an… …   Wikipedia

• Semaphore (programming) — For other uses, see Semaphore (disambiguation). In computer science, a semaphore is a variable or abstract data type that provides a simple but useful abstraction for controlling access by multiple processes to a common resource in a parallel… …   Wikipedia